Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
نویسندگان
چکیده
We consider the inclusion and equivalence problem for unambiguous Büchi automata. We show that for a strong version of unambiguity introduced by Carton and Michel these two problems are solvable in polynomial time. We generalize this to Büchi automata with a fixed finite degree of ambiguity in the strong sense. We also discuss the problems that arise when considering the decision problems for the standard notion of ambiguity for Büchi automata.
منابع مشابه
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Büchi, Co-Büchi, and parity automata play a similar role in the recognition of ω-regular languages. While it is well known that the minimisation of deterministic finite and weak automata i...
متن کاملImproved Upper and Lower Bounds for Büchi Disambiguation
We present a new ranking based construction for disambiguating non-deterministic Büchi automata and show that the state complexity tradeoff of the translation is in O(n · (0.76n)). This exponentially improves the best upper bound (i.e., 4 · (3n)) known earlier for Büchi disambiguation. We also show that the state complexity tradeoff of translating non-deterministic Büchi automata to strongly un...
متن کاملMinimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata
In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Büchi, Co-Büchi, and parity automata play a similar role in the recognition of ω-regular languages. While it is well known that the minimisation of deterministic finite and weak automata ...
متن کاملModel Checking Markov Chains Against Unambiguous Buchi Automata
An automaton is unambiguous if each word has at most one accepting run and separated if no word is accepted from two distinct states. The classical translation of LTL formulas to Büchi automata [5] produces unambiguous separated automata since the states of such automata correspond to complete subformula types. Motivated by this observation, Couvreur et al. [3] present a polynomialtime algorith...
متن کاملOn Büchi One-Counter Automata
Equivalence of deterministic pushdown automata is a famous problem in theoretical computer science whose decidability has been shown by Sénizergues. Our first result shows that decidability no longer holds when moving from finite words to infinite words. This solves an open problem that has recently been raised by Löding. In fact, we show that already the equivalence problem for deterministic B...
متن کامل